An Energy-minimizing Interpolation for Multigrid Methods
نویسنده
چکیده
We shall study multigrid methods from energy minimizations and approximations. Through the analysis of an multigrid method in 1D, we introduce the concepts of stability and the approximation property in the classical theory. Based on them, we derive an energy-minimizing interpolation and present a two level analysis for it. Issues on coarsening are also addressed. Finally, we demonstrate the eeectiveness of the multigrid method by applying it to unstructured grids computations and discontinuous coeecient problems.
منابع مشابه
Application of an Energy-minimizing Algebraic Multigrid Method for Subsurface Water Simulations
Efficient methods for solving linear algebraic equations are crucial to creating fast and accurate numerical simulations in many applications. In this paper, an algebraic multigrid (AMG) method, which combines the classical coarsening scheme by [19] with an energy-minimizing interpolation algorithm by [26], is employed and tested for subsurface water simulations. Based on numerical tests using ...
متن کاملAn Energy-minimizing Interpolation for Robust Multigrid Methods
We propose a robust interpolation for multigrid based on the concepts of energy minimization and approximation. The formulation is general; it can be applied to any dimensions. The analysis for one dimension proves that the convergence rate of the resulting multigrid method is independent of the coeecient of the underlying PDE, in addition to being independent of the mesh size. We demonstrate n...
متن کاملAlgebraic multigrid methods based on compatible relaxation and energy minimization
This paper presents an adaptive algebraic multigrid method for the solution of positive definite linear systems arising from the discretizations of elliptic partial differential equations. The proposed method uses compatible relaxation to adaptively construct the set of coarse variables. The nonzero supports for the coarse-space basis is determined by approximation of the so-called two-level “i...
متن کاملMultilevel Algebraic Elliptic Solvers
We survey some of the recent research in developing multilevel algebraic solvers for elliptic problems. A key concept is the design of a hierarchy of coarse spaces and related interpolation operators which together satisfy certain approximation and stability properties to ensure the rapid convergence of the resulting multigrid algorithms. We will discuss smoothed agglomeration methods, harmonic...
متن کاملAlgebraic multigrid based on computational molecules, 2: Systems of elliptic partial differential equations
This paper deals with a new approach in algebraic multigrid (AMG) for self-adjoint and elliptic problems arising from finite-element (FE) discretization of systems of partial differential equations (PDEs). Generalizing our approach for scalar problems [15], we propose an edge matrix concept regarding systems of PDEs. This gives a simple and reliable method for the evaluation of the strength of ...
متن کامل